# 使用递归函数重构斐波那契函数：f(n) = f(n-1) + f(n-2)
from pprint import pprint
# 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377,

def fib(x):
    if x <= 1:
        return x
    else:
        return fib(x - 1) + fib(x - 2)

for i in range(1,15):
    print(fib(i),end=', ')


